A Universal Rank-Size Law
نویسندگان
چکیده
A mere hyperbolic law, like the Zipf's law power function, is often inadequate to describe rank-size relationships. An alternative theoretical distribution is proposed based on theoretical physics arguments starting from the Yule-Simon distribution. A modeling is proposed leading to a universal form. A theoretical suggestion for the "best (or optimal) distribution", is provided through an entropy argument. The ranking of areas through the number of cities in various countries and some sport competition ranking serves for the present illustrations.
منابع مشابه
Unraveling the Rank-Size Rule with Self-Similar Hierarchies
Many scientists are interested in but puzzled by the various inverse power laws with a negative exponent 1 such as the rank-size rule. The rank-size rule is a very simple scaling law followed by many observations of the ubiquitous empirical patterns in physical and social systems. Where there is a rank-size distribution, there will be a hierarchy with cascade structure. However, the equivalence...
متن کاملComments on \Bell curves and monkey languages" (letter to the editor
Whether there are universal laws or principles in complex systems is a fascinating and important question. Prof. John Casti uses the case of Normal Distribution (\bell curves") to illustrate that such universal principle is perhaps out there waiting to be discovered [1]. He suggests Zipf's law as a candidate for such universal principle. But as the author of one of the three publications to pro...
متن کاملComments to "Bell Curves and Monkey Languages", J. Casti, Complexity, 1, 12-15 1995.
Whether there are universal laws or principles in complex systems is a fascinating and important question. Prof. John Casti uses the case of Normal Distribution (\bell curves") to illustrate that such universal principle is perhaps out there waiting to be discovered [1]. He suggests Zipf's law as a candidate for such universal principle. But as the author of one of the three publications to pro...
متن کاملUniversal Emergence of PageRank
The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter α ∈]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of PageRank vector at its emergence when α → 1. The whole network...
متن کاملModelling of Population Migration to Reproduce Rank-Size Distribution of Cities in Japan
We investigate the rank-size distribution of cities in Japan by data analysis and computer simulation. From our previous data analysis of the census data after World War II, it has been clarified that the power exponent of the rank-size distribution of cities changes with time and Zipf’s law holds only for a restricted period. We show that Zipf’s law broke down owing to the great mergers and re...
متن کامل